Shortest path problem in rectangular complexes of global nonpositive curvature
نویسندگان
چکیده
منابع مشابه
Shortest path problem in rectangular complexes of global nonpositive curvature
CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric space are connected by a unique shortest path γ(x, y). In this paper, we present an efficient algorithm for answering two-point distance queries in CAT(0) rectangular complexes and two of theirs subclasses, ramified rectilinear po...
متن کاملFoldable cubical complexes of nonpositive curvature
We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dimX = 3, X contains a closed rank one geodesic in the 1-skeleton unless the universal cover of X is isometric to the product of two CAT(0) cubical complexes. AMS Classification 20F65, 20F67; 53C20
متن کاملDubins' Problem on Surfaces II: Nonpositive Curvature
Let M be a complete, connected, two-dimensional Riemannian manifold with nonpositive Gaussian curvature K. We say that M satisfies the unrestricted complete controllability (UCC) property for the Dubins problem if the following holds: given any (p1, v1) and (p2, v2) in TM , there exists, for every ε > 0, a curve γ in M , with geodesic curvature smaller than ε, such that γ connects p1 to p2 and,...
متن کاملAlgorithms for distance problems in planar complexes of global nonpositive curvature
CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an algorithm for answering single-point distance queries in a CAT(0) planar complex. Namely, we show that for a CAT(0) planar complex K with n vertices, one can con...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.04.002